NScale: neighborhood-centric large-scale graph analytics in the cloud
نویسندگان
چکیده
منابع مشابه
NScale: Neighborhood-centric Analytics on Large Graphs
There is an increasing interest in executing rich and complex analysis tasks over large-scale graphs, many of which require processing and reasoning about a large number of multi-hop neighborhoods or subgraphs in the graph. Examples of such tasks include ego network analysis, motif counting in biological networks, finding social circles, personalized recommendations, link prediction, anomaly de...
متن کاملGoFFish: A Sub-graph Centric Framework for Large-Scale Graph Analytics
Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ...
متن کاملTowards Neighborhood Window Analytics over Large-Scale Graphs
Information networks are often modeled as graphs, where the vertices are associated with attributes. In this paper, we study neighborhood window analytics, namely k-hop window query, that aims to capture the properties of a local community involving the k-hop neighbors (defined on the graph structures) of each vertex. We develop a novel index, Dense Block Index (DBIndex), to facilitate efficien...
متن کاملHybrid Cloud Support for Large Scale Analytics and Web Processing
Platform-as-a-service (PaaS) systems, such as Google App Engine (GAE), simplify web application development and cloud deployment by providing developers with complete software stacks: runtime systems and scalable services accessible from well-defined APIs. Extant PaaS offerings are designed and specialized to support large numbers of concurrently executing web applications (multi-tier programs ...
متن کامل14462 Systems and Algorithms for Large - scale Graph Analytics
This report documents the program and the outcomes of Dagstuhl Seminar 14462 “Systems and Algorithms for Large-scale Graph Analytics”. The seminar was a successful gathering of computer scientists from the domains of systems, algorithms, architecture and databases all of whom are interested in graph processing. Seminar November 9–12, 2014 – http://www.dagstuhl.de/14462 1998 ACM Subject Classifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 2015
ISSN: 1066-8888,0949-877X
DOI: 10.1007/s00778-015-0405-2